Traducción y análisis de palabras por inteligencia artificial ChatGPT
En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
- cómo se usa la palabra
- frecuencia de uso
- se utiliza con más frecuencia en el habla oral o escrita
- opciones de traducción
- ejemplos de uso (varias frases con traducción)
- etimología
join irreducible - traducción al ruso
математика
неразложимый в объединение
!['''Pic. 7:''' Non-lattice poset: <math>b</math> and <math>c</math> have common upper bounds <math>d, e,</math> and <math>f,</math> but none of them is the [[least upper bound]].](https://commons.wikimedia.org/wiki/Special:FilePath/NoLatticeDiagram.svg?width=200 "'''Pic. 7:''' Non-lattice poset: <math>b</math> and <math>c</math> have common upper bounds <math>d, e,</math> and <math>f,</math> but none of them is the [[least upper bound]].")
!['''Pic. 8:''' Non-lattice poset: <math>a</math> and <math>b</math> have common lower bounds <math>0, d, g, h,</math> and <math>i,</math> but none of them is the [[greatest lower bound]].](https://commons.wikimedia.org/wiki/Special:FilePath/Pow3nonlattice.svg?width=200 "'''Pic. 8:''' Non-lattice poset: <math>a</math> and <math>b</math> have common lower bounds <math>0, d, g, h,</math> and <math>i,</math> but none of them is the [[greatest lower bound]].")
!['''Pic. 1:''' Subsets of \{x, y, z\}, under [[set inclusion]]. The name "lattice" is suggested by the form of the [[Hasse diagram]] depicting it.](https://commons.wikimedia.org/wiki/Special:FilePath/Hasse diagram of powerset of 3.svg?width=200 "'''Pic. 1:''' Subsets of \{x, y, z\}, under [[set inclusion]]. The name \"lattice\" is suggested by the form of the [[Hasse diagram]] depicting it.")
![partition]]s of \{1, 2, 3, 4\}, ordered by "''refines''".](https://commons.wikimedia.org/wiki/Special:FilePath/Lattice of partitions of an order 4 set.svg?width=200 "partition]]s of \{1, 2, 3, 4\}, ordered by \"''refines''\".")
общая лексика
объединенный
объединяемый
сращенный
Wikipedia
In algebra, casus irreducibilis (Latin for "the irreducible case") is one of the cases that may arise in solving polynomials of degree 3 or higher with integer coefficients algebraically (as opposed to numerically), i.e., by obtaining roots that are expressed with radicals. It shows that many algebraic numbers are real-valued but cannot be expressed in radicals without introducing complex numbers. The most notable occurrence of casus irreducibilis is in the case of cubic polynomials that have three real roots, which was proven by Pierre Wantzel in 1843. One can see whether a given cubic polynomial is in so-called casus irreducibilis by looking at the discriminant, via Cardano's formula.
